"phantom type" meaning in All languages combined

{
  "forms": [
    {
      "form": "phantom types",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "phantom type (plural phantom types)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "2004 July 31, Markus Mottl, \"Phantom types\" on caml-listhttps://web.archive.org/web/20200622172054/https://caml.inria.fr/pub/ml-archives/caml-list/2004/07/3a19a05047ea9332426bba1d8bc403ce.en.html\nPhantom types not only allow you to capture constraints, which are proved by the compiler, they are also perfectly cheap computationally, because you don't have to check things at runtime all the time."
        }
      ],
      "glosses": [
        "A parameterized type that does not depend on all of its type parameters."
      ],
      "id": "en-phantom_type-en-noun-Yu~TeyIY",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "parameterized",
          "parameterized"
        ],
        [
          "type",
          "type"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A parameterized type that does not depend on all of its type parameters."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "phantom type"
}

{
  "forms": [
    {
      "form": "phantom types",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "phantom type (plural phantom types)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "text": "2004 July 31, Markus Mottl, \"Phantom types\" on caml-listhttps://web.archive.org/web/20200622172054/https://caml.inria.fr/pub/ml-archives/caml-list/2004/07/3a19a05047ea9332426bba1d8bc403ce.en.html\nPhantom types not only allow you to capture constraints, which are proved by the compiler, they are also perfectly cheap computationally, because you don't have to check things at runtime all the time."
        }
      ],
      "glosses": [
        "A parameterized type that does not depend on all of its type parameters."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "parameterized",
          "parameterized"
        ],
        [
          "type",
          "type"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A parameterized type that does not depend on all of its type parameters."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "phantom type"
}